An Efficient and Stable Method for Parallel Factorization of Dense Symmetric Indefinite Matrices
نویسنده
چکیده
This paper investigates the efficient parallelization of algorithms with strong stability guarantees to factor dense symmetric indefinite matrices. It shows how the bounded Bunch-Kaufman algorithm may be efficiently parallelized, and then how its performance can be enhanced by using exhaustive block searching techniques, which is effective in keeping most symmetric interchanges within the current elimination block. This can avoid wasted computation and the communication normally involved in parallel symmetric interchanges, but requires considerable effort to reduce its introduced overheads. It has also great potential for out-of-core algorithms. Results on a 16 node Fujitsu AP3000 multicomputer showed the block search increased performance over the (plain) bounded Bunch-Kaufman algorithm by 5–14% on strongly indefinite matrices, and in some cases out-performing the well-known Bunch-Kaufman algorithm (which is without strong stability guarantees).
منابع مشابه
Communication-Avoiding Symmetric-Indefinite Factorization
We describe and analyze a novel symmetric triangular factorization algorithm. The algorithm is essentially a block version of Aasen’s triangular tridiagonalization. It factors a dense symmetric matrix A as the product A = PLTLP where P is a permutation matrix, L is lower triangular, and T is block tridiagonal and banded. The algorithm is the first symmetric-indefinite communication-avoiding fac...
متن کاملNew Pivot Selection for Sparse Symmetric Indefinite Factorization
We propose a new pivot selection technique for symmetric indefinite factorization of sparse matrices. Such factorization should maintain both sparsity and numerical stability of the factors, both of which depend solely on the choices of the pivots. Our method is based on the minimum degree algorithm and also considers the stability of the factors at the same time. Our experiments show that our ...
متن کاملTowards a stable static pivoting strategy for the sequential and parallel solution of sparse symmetric indefinite systems
We consider the direct solution of sparse symmetric indefinite matrices. We develop new pivoting strategies that combine numerical and static pivoting. Furthermore, we propose original approaches that are designed for parallel distributed factorization. We show that our pivoting strategies are numerically robust and that the factorization is significantly faster because of this static/numerical...
متن کاملThe design and use of a sparse direct solver for skew symmetric matrices
We consider the direct solution of sparse skew symmetric matrices. We see that the pivoting strategies are similar, but simpler, to those used in the factorization of sparse symmetric indefinite matrices, and we briefly describe the algorithms used in a forthcoming direct code based on multifrontal techniques for the factorization of real skew symmetric matrices. We show how this factorization ...
متن کاملSymmetric Quasidefinite Matrices
We say that a symmetric matrix K is quasi-definite if it has the form K = [ −E AT A F ] where E and F are symmetric positive definite matrices. Although such matrices are indefinite, we show that any symmetric permutation of a quasi-definite matrix yields a factorization LDLT . We apply this result to obtain a new approach for solving the symmetric indefinite systems arising in interior-point m...
متن کامل